On the covering radius of some binary cyclic codes
نویسندگان
چکیده
We compute the covering radius of some families of binary cyclic codes. In particular, we compute the covering radius of cyclic codes with two zeros and minimum distance greater than 3. We compute the covering radius of some binary primitive BCH codes over F2f , where f = 7, 8.
منابع مشابه
The covering radius of cyclic codes of length up to 31
Remark 4: The author is unable to deal analytically with the general case of p + l/2 where one does not have the property of symmetry. However, the case that p is close to l/2 may be tractabie an9 interesting. Linear smoothing using measurements containing correlated noise with an application to inertial navigation, " IEEE Trans. Abstract-The covering radius is given for all binary cyclic codes...
متن کاملSome new lower bounds for ternary covering codes
In [5], we studied binary codes with covering radius one via their characteristic functions. This gave us an easy way of obtaining congruence properties and of deriving interesting linear inequalities. In this paper we extend this approach to ternary covering codes. We improve on lower bounds for ternary 1-covering codes, the so-called football pool problem, when 3 does not divide n − 1. We als...
متن کاملOn Upper Bounds for Minimum Distances and Covering Radius of Non-binary Codes
We consider upper bounds on two fundamental parameters of a code; minimum distance and covering radius. New upper bounds on the covering radius of non-binary linear codes are derived by generalizing a method due to S. Litsyn and A. Tiett avv ainen 10] and combining it with a new upper bound on the asymptotic information rate of non-binary codes. The new upper bound on the information rate is an...
متن کاملNormality of some binary linear codes
We show that all binary codes of lengths 16, 17 and 18, or redundancy 10, are normal. These results have applications in the construction of codes that attain t[n, k], the smallest covering radius of any binary linear code.
متن کاملOn a family of binary completely transitive codes with growing covering radius
A new family of binary linear completely transitive (and, therefore, completely regular) codes is constructed. The covering radius of these codes is growing with the length of the code. In particular, for any integer ρ ≥ 2, there exist two codes with d = 3, covering radius ρ and length ( 4 ρ 2 )
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Adv. in Math. of Comm.
دوره 11 شماره
صفحات -
تاریخ انتشار 2017